Compile-time techniques for efficient utilization of parallel memories

Compile-Time Cost Analysis for Parallel Programming

This paper focuses on the compile-time cost analysis of programs expressed in the BMF-style, which results in the selection of a cost-eeective parallel implementation on a given topology.

Message from the Chairs: International Workshop on Compile and Run Time Techniques for Parallel Computing

Welcome to the ICPP Workshop on Compile/Run Time Techniques for Parallel Computing (CRTPC-04) held in conjunction with the International Conference on Parallel Processing (ICPP-04) in Montreal, Canada, August 15–18, 2004. It is widely recognized that although the peak performance of parallel systems continues to advance steadily, the sustained realization of high efficiency on parallel systems ...

Compile-Time Communication Scheduling on Parallel Systems

In applications requiring very high throughput such as real time image processing and digital signal processing, the use of parallel processing techniques has become widespread. However, the potential performance gains from using multiple processors can be diminished by the communication overhead inherent in these systems. Reducing this overhead would drastically improve system performance. In ...

Some Techniques for Compile-Time Analysis of User-Computer Interactions

Compile-time techniques j b r analyzing user-computer interactions and the relationships and dependencies among items of‘dutu thut e.uist during the execution ofinteructive application programs are presented. These techniques are useful in constructing eficient compilers f i ~ r lunguages in which such interactions and data item relationships and dependencies are described by nonprocedural stat...

High-Performance Algorithms for Compile-Time Scheduling of Parallel Processors